Genetic Basis of a Cognitive Complexity Metric

نویسندگان

  • Narelle K. Hansell
  • Graeme S. Halford
  • Glenda Andrews
  • David H. K. Shum
  • Sarah E. Harris
  • Gail Davies
  • Sanja Franic
  • Andrea Christoforou
  • Brendan Zietsch
  • Jodie Painter
  • Sarah E. Medland
  • Erik A. Ehli
  • Gareth E. Davies
  • Vidar M. Steen
  • Astri J. Lundervold
  • Ivar Reinvang
  • Grant W. Montgomery
  • Thomas Espeseth
  • Hilleke E. Hulshoff Pol
  • John M. Starr
  • Nicholas G. Martin
  • Stephanie Le Hellard
  • Dorret I. Boomsma
  • Ian J. Deary
  • Margaret J. Wright
چکیده

Relational complexity (RC) is a metric reflecting capacity limitation in relational processing. It plays a crucial role in higher cognitive processes and is an endophenotype for several disorders. However, the genetic underpinnings of complex relational processing have not been investigated. Using the classical twin model, we estimated the heritability of RC and genetic overlap with intelligence (IQ), reasoning, and working memory in a twin and sibling sample aged 15-29 years (N = 787). Further, in an exploratory search for genetic loci contributing to RC, we examined associated genetic markers and genes in our Discovery sample and selected loci for replication in four independent samples (ALSPAC, LBC1936, NTR, NCNG), followed by meta-analysis (N>6500) at the single marker level. Twin modelling showed RC is highly heritable (67%), has considerable genetic overlap with IQ (59%), and is a major component of genetic covariation between reasoning and working memory (72%). At the molecular level, we found preliminary support for four single-marker loci (one in the gene DGKB), and at a gene-based level for the NPS gene, having influence on cognition. These results indicate that genetic sources influencing relational processing are a key component of the genetic architecture of broader cognitive abilities. Further, they suggest a genetic cascade, whereby genetic factors influencing capacity limitation in relational processing have a flow-on effect to more complex cognitive traits, including reasoning and working memory, and ultimately, IQ.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cognitive Weighted Polymorphism Factor: A Comprehension Augmented Complexity Metric

Polymorphism is one of the main pillars of objectoriented paradigm. It induces hidden forms of class dependencies which may impact software quality, resulting in higher cost factor for comprehending, debugging, testing, and maintaining the software. In this paper, a new cognitive complexity metric called Cognitive Weighted Polymorphism Factor (CWPF) is proposed. Apart from the software structur...

متن کامل

Cognitive Weighted Method Hiding Factor Complexity Metric

Method hiding plays a key role by serving the foundation for several guidelines in object-oriented software design. It brings about plethora of benefits such as easy comprehension, secured accessibility, modifiability without side-effects, modular testing, higher reliability etc. But, it has to be handled carefully since very low method hiding may result in insufficiently abstracted implementat...

متن کامل

Improving Success Ratio in Multi-Constraint Quality of Service Routing

Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...

متن کامل

Measurement of Complexity and Comprehension of a Program Through a Cognitive Approach

The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...

متن کامل

Solis Graphs and Uniquely Metric Basis Graphs

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

متن کامل

The effect of increase in task cognitive complexity on Iranian EFL learners’ accuracy and linguistic complexity: A test of Robinson’s Cognition Hypothesis

Designing a task with a reasonable level of cognitive complexity has always been important for syllabus designers, teachers, as well as researchers. This is because task manipulation may lead to different results in oral production. The present study was an attempt to explore the effect of this  manipulation  -  based  on  Robinson’s  resource-directing  model  (reasoning  demands, number of el...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2015